Routeing winter gritting vehicles

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Network Routeing

We believe that the control currently provided by routeing in the Internet is becoming demonstrably insufficient for the demands of network operators and users. Current routeing protocols provide little or no support for automation of network management, leaving such things as construction and implementation of SLAs and the pricing of resources entirely to the network manager. The research prop...

متن کامل

Video-based Parking Space Detection: Localisation of Vehicles and Development of an Infrastructure for a Routeing System

Searching for vacant parking spaces is a time-consuming and often irritating task. Car park routeing systems can assist drivers in this undertaking. Current parking systems either issue imprecise information or prove costly due to the required resources, and are thus unattractive for car park operators. In this paper, we propose a vehicle tracking and navigation module as part of a routeing sys...

متن کامل

Qos Based Routeing for High Speed Environment

With the new rise of applications such as multimedia, the networking environment has to provide more and more bandwidth and should be able to meet the

متن کامل

Routeing protocols development in the OSI architecture

Work on standardization of OSI routeing protocols has already started. A route-ing framework deening the functional components of the routeing problem was published. This paper discusses the OSI routeing problem and presents the addressing and routeing ar-chitectures used to solve it. It also gives some comments on the proposed routeing protocols, focusing on the need of a network layer Directo...

متن کامل

Efficient Routeing in Poisson Small-world Networks

In a recent paper, Kleinberg (2000) considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power, r−α , of the distance, r , between them. Kleinberg showed that greedy routeing is efficient if α = d and that there is no efficient decentralised routeing algorithm if α = d. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1994

ISSN: 0166-218X

DOI: 10.1016/0166-218x(92)00003-5